|
The Sousselier graph is, in graph theory, an hypohamiltonian graph with 16 vertices and 27 edges. ==History== Hypohamiltonian graphs were first studied by Sousselier in ''Problèmes plaisants et délectables'' (1963) . In 1967, Lindgren builds an infinite sequence of hypohamiltonian graphs. The graphs of this sequence all have 6''k''+10 vertices, for every integer ''k''.〔 , 〕 The same sequence of hypohamiltonian graphs is independently built by Sousselier.〔 〕 In 1973 Chvátal explains in a scientific paper how edges can be added to some hypohamiltonian graphs in order to build new ones of the same order, and he names Bondy as the original author of the method. As an illustration, he shows that two edges can be added to the second graph of the Lindgren sequence (which he names Sousselier sequence) in order to build a new hypohamiltonian graph on 16 vertices. This graph is named the Sousselier graph. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sousselier graph」の詳細全文を読む スポンサード リンク
|